Complementing Büchi Automata with Ranker

نویسندگان

چکیده

Abstract We present the tool Ranker for complementing Büchi automata (BAs). builds on our previous optimizations of rank-based BA complementation and pushes them even further using numerous heuristics to produce smaller automata. Moreover, it contains novel specialized constructions (i) inherently weak (ii) semi-deterministic automata, all delivered in a robust tool. The significantly improve usability , as shown an extensive experimental evaluation with real-world benchmarks, where produced majority cases strictly complement than other state-of-the-art tools.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complementing Semi-deterministic Büchi Automata

We introduce an efficient complementation technique for semi-deterministic Büchi automata, which are Büchi automata that are deterministic in the limit: from every accepting state onward, their behaviour is deterministic. It is interesting to study semi-deterministic automata, because they play a role in practical applications of automata theory, such as the analysis of Markov decision processe...

متن کامل

On Complementing Nondeterministic Büchi Automata

Several optimal algorithms have been proposed for the complementation of nondeterministic Büchi word automata. Due to the intricacy of the problem and the exponential blow-up that complementation involves, these algorithms have never been used in practice, even though an effective complementation construction would be of significant practical value. Recently, Kupferman and Vardi described a com...

متن کامل

Almost Linear Büchi Automata

We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Büchi automata (BA) called Almost linear Büchi automata (ALBA). We provide effective translations between LIO and ALBA showing that the two formalisms are expressively equivalent. While standard translations of LTL into BA use some intermediate formalisms, the presented translation of LIO into ALBA is direc...

متن کامل

Minimizing Generalized Büchi Automata

We consider the problem of minimization of generalized Büchi automata. We extend fair-simulation minimization and delayed-simulation minimization to the case where the Büchi automaton has multiple acceptance conditions. For fair simulation, we show how to efficiently compute the fair-simulation relation while maintaining the structure of the automaton. We then use the fairsimulation relation to...

متن کامل

Optimizing Büchi Automata

We describe a family of optimizations implemented in a translation from a linear temporal logic to B uchi automata. Such optimized automata can enhance the e ciency of model checking, as practiced in tools such as Spin. Some of our optimizations are applied during preprocessing of temporal formulas, while other key optimizations are applied directly to the resulting B uchi automata independen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-13188-2_10